Analysis of a Winning Computational Billiards Player
نویسندگان
چکیده
We discuss CUECARD, the program that won the 2008 Computer Olympiad computational pool tournament. Beside addressing intrinsic interest in a complex competitive environment with unique features, our goal is to isolate the factors that contributed to the performance so that the lessons can be transferred to other, similar domains. Specifically, we distinguish among pure engineering factors (such as using a computer cluster), domainspecific factors (such as optimized break shots), and domain-independent factors (such as state clustering). Our conclusion is that each type of factor contributed to the performance of the program.
منابع مشابه
Running the Table: An AI for Computer Billiards
Billiards is a game of both strategy and physical skill. To succeed, a player must be able to select strong shots, and then execute them accurately and consistently. Several robotic billiards players have recently been developed. These systems address the task of executing shots on a physical table, but so far have incorporated little strategic reasoning. They require AI to select the ‘best’ sh...
متن کامل" Whoever Called Snooker 'chess with Balls' Was Rude, but Right " Pickpocket: an Artificial Intelligence for Computer Billiards
Billiards is a game of both strategy and physical skill. To succeed, a player must be able to select strong shots, and then execute them accurately and consistently on the table. Several robotic billiards players have recently been developed. These systems address the task of executing shots on a physical table, but so far have incorporated little strategic reasoning. They require artificial in...
متن کاملRelaxed Update and Partition Network Games
In this paper, we study the complexity of deciding which player has a winning strategy in certain types of McNaughton games. These graph games can be used as models for computational problems and processes of infinite duration. We consider the cases (1) where the first player wins when vertices in a specified set are visited infinitely often and vertices in another specified set are visited fin...
متن کاملOn Game-Theoretic Models of Networks
In this paper, we study the complexity of deciding which player has a winning strategy in certain types of McNaughton games. These graph games can be used as models for computational problems and processes of infinite duration. We consider the cases (1) where the first player wins when vertices in a specified set are visited infinitely often and vertices in another specified set are visited fin...
متن کاملOn winning shifts of marked uniform substitutions
The second author introduced with I. Törmä a two-player word-building game [Playing with Subshifts, Fund. Inform. 132 (2014), 131–152]. The game has a predetermined (possibly finite) choice sequence α1, α2, . . . of integers such that on round n the player A chooses a subset Sn of size αn of some fixed finite alphabet and the player B picks a letter from the set Sn. The outcome is determined by...
متن کامل